Algebraic normal form

Results: 27



#Item
11NEARLY COMPACT AND CONTINUOUS NORMAL FORM GAMES: CHARACTERIZATIONS AND EQUILIBRIUM EXISTENCE C. J. HARRIS, M. B. STINCHCOMBE, AND W. ZAME Abstract. Normal form games are nearly compact and continuous (NCC) if they can be

NEARLY COMPACT AND CONTINUOUS NORMAL FORM GAMES: CHARACTERIZATIONS AND EQUILIBRIUM EXISTENCE C. J. HARRIS, M. B. STINCHCOMBE, AND W. ZAME Abstract. Normal form games are nearly compact and continuous (NCC) if they can be

Add to Reading List

Source URL: www.econ.ucla.edu

Language: English - Date: 2003-09-24 14:05:34
12Computing Persistent Homology  ∗ Afra Zomorodian

Computing Persistent Homology ∗ Afra Zomorodian

Add to Reading List

Source URL: www.ayasdi.com

Language: English - Date: 2015-02-12 20:18:44
13On a weakness of the Tu-Deng function and its repair Claude Carlet ∗

On a weakness of the Tu-Deng function and its repair Claude Carlet ∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-12-08 06:03:26
14On the Boolean functions With Maximum Possible Algebraic Immunity : Construction and A Lower Bound of the Count Abstract. This paper gives a construction method which can get a large class of Boolean functions with maxim

On the Boolean functions With Maximum Possible Algebraic Immunity : Construction and A Lower Bound of the Count Abstract. This paper gives a construction method which can get a large class of Boolean functions with maxim

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2006-04-07 22:30:07
15Microsoft Word - English-Final.doc

Microsoft Word - English-Final.doc

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2007-11-30 22:02:07
163-2 A Functional Cryptosystem Using a Group Action YAMAMURA Akihiro The main purpose of this paper is to examine applications of group theoretical concepts to cryptography. We construct a backward deterministic system em

3-2 A Functional Cryptosystem Using a Group Action YAMAMURA Akihiro The main purpose of this paper is to examine applications of group theoretical concepts to cryptography. We construct a backward deterministic system em

Add to Reading List

Source URL: www.nict.go.jp

Language: English - Date: 2013-11-21 18:57:46
17Chapter 1  Our Adversary: The Circuit Boolean (or switching) functions map each sequence of bits to a single bit 0 or 1. Bit 0 is usually interpreted as “false”, and bit 1 as “true”. The simplest of such

Chapter 1 Our Adversary: The Circuit Boolean (or switching) functions map each sequence of bits to a single bit 0 or 1. Bit 0 is usually interpreted as “false”, and bit 1 as “true”. The simplest of such

Add to Reading List

Source URL: www.thi.informatik.uni-frankfurt.de

Language: English - Date: 2012-03-10 09:14:00
18Microsoft Word - ijcai05d.doc

Microsoft Word - ijcai05d.doc

Add to Reading List

Source URL: www-aig.jpl.nasa.gov

Language: English - Date: 2007-06-28 00:31:02
19

PDF Document

Add to Reading List

Source URL: www.ayasdi.com

Language: English - Date: 2013-01-14 13:04:33
20The image of Galois representations attached to elliptic curves with an isogeny Ralph Greenberg† 1

The image of Galois representations attached to elliptic curves with an isogeny Ralph Greenberg† 1

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-05-07 16:32:51